The reduction of the search time by the pre-determination of the grid bit in the g.723.1 MP-MLQ

نویسندگان

  • Jong-Kuk Kim
  • Jeong-Jin Kim
  • Myung-Jin Bae
چکیده

In general CELP type vocoders provide good speech qu ality around 4.8kbps. Among them, G.723.1 developed f or Internet Phone and videoconferencing includes two v ocoders, 5.3kbps ACELP and 6.3kbps MP-MLQ. Since 6.3kbps MP-MLQ requires large amount of computation for the fixed codebook search, it is difficult to realize r eal time processing for the Internet-based environment. In order to improve the problem this paper proposes the new method that reduces the processing time up to abo ut 50% of codebook search time. We first decide the gr id bit, and then search the codebook. Grid bit is selecte d by comparison between the DC-removed original spee ch and synthesized speech, which is synthesized with o nly even or odd pulses of target vector.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity Reduction of the Stochastic Code -Vector Search for ITU-T G.723.1codec

For multimedia communications, the computational complexity of a multimedia codec is required to match with different working platforms and integrated services of media sources. In this paper, two fast stochastic codebook search algorithms are proposed to reduce the computation required for the algebraic code excited linear predictive (ACELP) and multi-pulse maximum likelihood quantization (MP-...

متن کامل

A Fast LSF Search Algorithm Based on Interframe Correlation in G.723.1

We explain a time complexity reduction algorithm that improves the line spectral frequencies (LSF) search procedure on the unit circle for low bit rate speech codecs. The algorithm is based on strong interframe correlation exhibited by LSFs. The fixed point C code of ITU-T Recommendation G.723.1, which uses the “real root algorithm” wasmodified and the results were verified on ARM7TDMI general ...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Low-Power Implementation of H.324 Audiovisual Codec Dedicated to Mobile Computing

A VLSI implementation of the H.324 audiovisual codec is described. A number of sophisticated low-power architectures have been devised dedicatedly for the mobile use. A set of specific functional units, each corresponding to a process of H.263 video codec, is employed to lighten different performance bottlenecks. A compact DSP core composed of two MAC units is used for both ACELP and MP-MLQ cod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000